R-LINE: A Better Randomized 2-Server Algorithm on the Line
نویسندگان
چکیده
Article history: Received 7 April 2015 Received in revised form 26 August 2015 Accepted 31 August 2015 Available online 3 September 2015 Communicated by D.-Z. Du
منابع مشابه
A randomized on-line algorithm for the k-server problem on a line
We give a O(n 2 3 logn)–competitive randomized k–server algorithm when the underlying metric space is given by n equally spaced points on a line. For n = k+o(k 3 2/ log k), this algorithm is o(k)–competitive.
متن کاملOptimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line
In the online metric bipartite matching problem, we are given a set S of server locations in a metric space. Requests arrive one at a time, and on its arrival, we need to immediately and irrevocably match it to a server at a cost which is equal to the distance between these locations. A α-competitive algorithm will assign requests to servers so that the total cost is at most α times the cost of...
متن کاملFusible HSTs and the randomized k-server conjecture
We show that a potential-based algorithm for the fractional k-server problem on hierarchically separated trees (HSTs) with competitive ratio f (k) can be used to obtain a randomized algorithm for anymetric spacewith competitive ratio f (k)2O((log k)2). Employing theO((log k)2)competitive algorithm for HSTs from our joint work with Bubeck, Cohen, Lee, and Mądry (2017), this yields an O((log k)6)...
متن کاملAn Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کاملA Randomized Algorithm for Two Servers in Cross Polytope Spaces
It has been a long-standing open problem to determine the exact randomized competitiveness of the 2-server problem, that is, the minimum competitiveness of any randomized online algorithm for the 2-server problem. For deterministic algorithms the best competitive ratio that can be obtained is 2 and no randomized algorithm is known that improves this ratio for general spaces. For the line, Barta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 605 شماره
صفحات -
تاریخ انتشار 2012